The phantom SPA method: an inventory problem revisited
نویسندگان
چکیده
It is widely accepted today that the Infinitesimal Perturbation Analysis (IPA) method for estimating sensitivities is the preferred method, when it is applicable. The major problem with IPA is handling certain kinds of discontinuities, such as thresholds. The Smoothed Perturbation Analysis (SPA) method was conceived applying a conditional expectation to a dynamic system, similar to the Filtered Monte Carlo Simulation. Conditioning smoothes out the discontinuities and then IPA can be applied to the conditional estimator. Since this alternative estimator has been partly integrated through the conditioning, some knowledge about the underlying distribution is required. When this is not available, SPA estimators require additional estimation. Traditionally, this has been implemented via off-line simulations that produce independent replications of a difference process. We propose here to bypass this operation by using parallel phantom systems: replicas of the original system that are conditional to the critical events of interest yet use common random numbers instead of independent replications. We show how the efficiency can dramatically improve from the gain in correlation (variance reduction) as well as the gain in computational effort (random variables are generated once and used for all parallel phantoms).
منابع مشابه
SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملFixing Phantom Stockouts: Optimal Data-Driven Shelf Inspection Policies
A “phantom stockout” is a retail stockout phenomenon caused either by inventory shrinkage or by shelf execution failure. Unlike the conventional stockout which can be corrected by inventory replenishment, a phantom stockout persists and requires human interventions. In this paper, we propose two partially-observable Markov decision models: one for the shrinkage problem and the other for the she...
متن کاملAn Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty
In this paper, we introduce a model to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999